Compressive Spectrum Sensing Using Sampling-Controlled Block Orthogonal Matching Pursuit
نویسندگان
چکیده
This paper proposes two novel schemes of wideband compressive spectrum sensing (CSS) via block orthogonal matching pursuit (BOMP) algorithm, for achieving high accuracy in real time. These aim to reliably recover the by adaptively adjusting number required measurements without inducing unnecessary sampling redundancy. To this end, minimum successful recovery is first derived terms its probabilistic lower bound. Then, a CSS scheme proposed tightening bound, where key design nonlinear exponential indicator through general-purpose sampling-controlled algorithm (SCA). In particular, BOMP (SC-BOMP) developed holistic integration existing and SCA. For fast implementation, modified version SC-BOMP further exploring orthogonality form sub-coherence measurement matrices, which allows more smaller bound measurements. Such achieves desired tradeoff between complexity performance. Simulations demonstrate that outperform other benchmark algorithms.
منابع مشابه
Reconstruction of Compressive Sensing Signal using Orthogonal Matching Pursuit Algorithm
This paper represents the reconstruction of sampled signal in CS by using OMP algorithm. We have used the concept of compressive sensing for sub Nyquist sampling of sparse signal. Compressive sensing reconstruction methods have complex algorithms of l1 optimisation to reconstruct a signal sampled at sub nyquist rate. But out of those algorithm OMP algorithm is fast and computationally efficient...
متن کاملSensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing Sensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing
In compressive sensing, the fundamental problem is to reconstruct sparse signal from its nonadaptive insufficient linear measurement. Besides sparse signal reconstruction algorithms, measurement matrix or measurement dictionary plays an important part in sparse signal recovery. Orthogonal Matching Pursuit (OMP) algorithm, which is widely used in compressive sensing, is especially affected by me...
متن کاملProbabilistic Matching Pursuit for Compressive Sensing
Compressive sensing investigates the recovery of a signal that can be sparsely represented in an orthonormal basis or overcomplete dictionary given a small number of linear combinations of the signal. We present a novel matching pursuit algorithm that uses the measurements to probabilistically select a subset of bases that is likely to contain the true bases constituting the signal. The algorit...
متن کاملSparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm
Wideband wireless channel is a time dispersive channel and becomes strongly frequency-selective. However, in most cases, the channel is composed of a few dominant taps and a large part of taps is approximately zero or zero. To exploit the sparsity of multi-path channel (MPC), two methods have been proposed. They are, namely, greedy algorithm and convex program. Greedy algorithm is easy to be im...
متن کاملApplications of the Orthogonal Matching Pursuit/ Nonlinear Least Squares Algorithm to Compressive Sensing Recovery
Compressive sensing (CS) has been widely investigated as a method to reduce the sampling rate needed to obtain accurate measurements of sparse signals (Donoho, 2006; Candes & Tao, 2006; Baraniuk, 2007; Candes & Wakin, 2008; Loris, 2008; Candes et al., 2011; Duarte & Baraniuk, 2011). CS depends on mixing a sparse input signal (or image) down in dimension, digitizing the reduced dimension signal,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2023
ISSN: ['1558-0857', '0090-6778']
DOI: https://doi.org/10.1109/tcomm.2022.3229415